Randomized algorithm

Results: 630



#Item
11Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI  GOLDWASSER,

Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER,

Add to Reading List

Source URL: groups.csail.mit.edu

Language: English - Date: 2003-04-15 15:57:50
12Journal of Machine Learning Research872  Submitted 2/09; Revised 12/09; Published 2/10 A Streaming Parallel Decision Tree Algorithm Yael Ben-Haim

Journal of Machine Learning Research872 Submitted 2/09; Revised 12/09; Published 2/10 A Streaming Parallel Decision Tree Algorithm Yael Ben-Haim

Add to Reading List

Source URL: jmlr.csail.mit.edu

Language: English - Date: 2010-02-23 15:21:29
13Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA

Add to Reading List

Source URL: web.stanford.edu

Language: English - Date: 2014-04-18 04:16:48
14Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗  Christoph Lenzen

Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:31
15Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions Pankaj K. Agarwaly Micha Sharirz

Pipes, Cigars, and Kreplach: The Union of Minkowski Sums in Three Dimensions Pankaj K. Agarwaly Micha Sharirz

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2012-06-29 10:27:51
16UNIFORM GRIDS: A TECHNIQUE FOR INTERSECTION DETECTION ON SERIAL AND PARALLEL MACHINES Wm. Randolph Franklin Chandrasekhar Narayanaswaml Mohan Kankanhalll

UNIFORM GRIDS: A TECHNIQUE FOR INTERSECTION DETECTION ON SERIAL AND PARALLEL MACHINES Wm. Randolph Franklin Chandrasekhar Narayanaswaml Mohan Kankanhalll

Add to Reading List

Source URL: mapcontext.com

Language: English
17LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2009-01-01 08:42:54
18CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

CS264: Beyond Worst-Case Analysis Lecture #20: From Unknown Input Distributions to Instance Optimality∗ Tim Roughgarden† December 3, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-29 00:22:18
19Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡  Shaddin Dughmi§

Truthful Approximation Schemes for Single-Parameter Agents∗ Peerapong Dhangwatnotai† Shahar Dobzinski‡ Shaddin Dughmi§

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2011-05-11 07:37:06
20An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant

An Efficient Parallel Repetition Theorem Johan H˚ astad1 , Rafael Pass2, Douglas Wikstr¨ om3 , and Krzysztof Pietrzak4 1 KTH, Stockholm, supported by ERC grant

Add to Reading List

Source URL: www.nada.kth.se

Language: English - Date: 2012-05-30 08:53:38